Linearly recurrent subshifts have a finite number of non-periodic subshift factors
نویسنده
چکیده
A minimal subshift (X, T ) is linearly recurrent if there exists a constant K so that for each clopen set U generated by a finite word u the return time to U , with respect to T , is bounded by K|u|. We prove that given a linearly recurrent subshift (X, T ) the set of its non-periodic subshift factors is finite up to isomorphism. We also give a constructive characterization of these subshifts.
منابع مشابه
Corrigendum and addendum to: Linearly recurrent subshifts have a finite number of non-periodic factors
We prove that a subshift (X, T ) is linearly recurrent if and only if it is a primitive and proper S-adic subshift. This corrects Proposition 6 in F. Durand (Ergod. Th. & Dynam. Sys. 20 (2000), 1061–1078).
متن کاملBlock gluing intensity of bidimensional SFT: computability of the entropy and periodic points
It is possible to define mixing properties for subshifts according to the intensity which allows to concatenate two rectangular blocks. We study the interplay between this intensity and computational properties. In particular we prove that there exists linearly block gluing subshift of finite type which are aperiodic and that all right-recursively enumerable positive number can be realized as e...
متن کاملha o - dy n / 99 10 00 3 v 1 3 O ct 1 99 9 Chaotic Properties of Subshifts Generated by a Non - Periodic Recurrent Orbit July 1999 Xin -
The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain non-periodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in metric spaces. These concepts include nonwandering point, recurrent point, eventually periodic point, scrambled set, sensitive dependence on initial conditions...
متن کاملOn the Density of Periodic Configurations in Strongly Irreducible Subshifts
Let G be a residually finite group and let A be a finite set. We prove that if X ⊂ A is a strongly irreducible subshift of finite type containing a periodic configuration then periodic configurations are dense in X. The density of periodic configurations implies in particular that every injective endomorphism of X is surjective and that the group of automorphisms of X is residually finite. We a...
متن کاملRecursive Cellular Automata Invariant Sets
A bstract. Subshift s of bi-infinit e words give rise to languages in a natural way. Three invariant subshifts associated wit h cellular automata dynamics are considered : the periodic set, non-wandering set , and limit set . Exam ples have been given (see [8,12]) of cellular automata whose invarian t sets give rise to nonrecursive languages. In this pap er , examples are given of cellular aut ...
متن کامل